def fib(max):
    n, a, b = 0, 0, 1
    while n < max:
        yield b
        a, b = b, a + b
        n = n + 1


def fib_2(max):
    if max <= 2:
        return 1
    return fib_2(max - 1) + fib_2(max - 2)


print(fib_2(2))
# for n in fib(10):
#     print(n)

# for n in range(10):
#     print(fib_2(n+1))

